THE POWER‐SAVING MANIN–PEYRE CONJECTURE FOR A SENARY CUBIC

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Manin's Conjecture for a Cubic Surface

The Manin conjecture is established for a split singular cubic surface in P, with singularity type D5.

متن کامل

A bound for Feichtinger conjecture

In this paper‎, ‎using the discrete Fourier transform in the finite-dimensional Hilbert space C^n‎, ‎a class of nonRieszable equal norm tight frames is introduced ‎and‎ using this class, a bound for Fiechtinger Conjecture is presented. By the Fiechtinger Conjecture that has been proved recently, for given A,C>0 there exists a universal constant delta>0 independent of $n$ such that every C-equal...

متن کامل

The Tate conjecture for cubic fourfolds over a finite field

If X/F is a smooth projective variety over a finite field F of characteristic p > 0 and X = X ⊗ F, there is a cycle class map CH(X)→ H et (X,Q`(i)) for ` 6= p from the Chow group of codimension i cycles on X to étale cohomology. The image of this map lies in the subspace of H et (X,Q`(i)) which is invariant under the natural Galois action. In [T3], Tate conjectures that, in fact, this subspace ...

متن کامل

Kummer’s Conjecture for Cubic Gauss Sums

for primes p ≡ 1 (mod 3) up to 500, and found that Sp/(2√p) lay in the intervals [−1,− 12 ], (− 12 , 12 ), [ 1 2 , 1] with frequencies approximately in the ratio 1 : 2 : 3. He conjectured, somewhat hesitantly, that this might be true asymptotically. Kummer’s conjecture was disproved by Heath-Brown and Patterson [4]. In order to state their result we must introduce a little notation. Let ω = exp...

متن کامل

Erdös-Gyárfás Conjecture for Cubic Planar Graphs

In 1995, Paul Erdős and András Gyárfás conjectured that for every graph of minimum degree at least 3, there exists a non-negative integer m such that G contains a simple cycle of length 2m. In this paper, we prove that the conjecture holds for 3-connected cubic planar graphs. The proof is long, computer-based in parts, and employs the Discharging Method in a novel way.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematika

سال: 2019

ISSN: 0025-5793,2041-7942

DOI: 10.1112/s0025579319000159